Maximal connected
نویسندگان
چکیده
Let k k be any field and let alttext="upper G"> G encoding="application/x-tex">G a connected reductive algebraic -group. Associated to is an invariant first studied in the 1960s by Satake [Ann. of Math. (2) 71 (1960), 77–110] Tits [Théorie des Groupes Algébriques (Bruxelles, 1962), Librairie Universitaire, Louvain; Gauthier- Villars, Paris, 1962], [Algebraic Groups Discontinuous Subgroups (Proc. Sympos. Pure Math., Boulder, Colo., 1965), Amer. Soc., Providence, R.I., 1966, pp. 33–62] that called index (a Dynkin diagram along with some additional combinatorial information). showed -isogeny class uniquely determined its anisotropic kernel G Subscript a"> a encoding="application/x-tex">G_a . For cases where absolutely simple, all possibilities for have been classified 33–62]. H"> H encoding="application/x-tex">H -subgroup maximal rank We introduce left-parenthesis k right-parenthesis"> ( stretchy="false">) encoding="application/x-tex">G(k) -conjugacy embedding indices H subset-of upper ⊂ encoding="application/x-tex">H \subset G This consists map satisfies certain compatibility conditions. equivalence relation index-conjugacy on set -subgroups , observe encoding="application/x-tex">H_a show indices. simple exceptional type we classify Finally, establish existence results. In particular, consider which embeddings exist when has cohomological dimension 1 (resp. alttext="k equals double-struck R"> = R encoding="application/x-tex">k=\mathbb {R} alttext="German p"> mathvariant="fraktur">p encoding="application/x-tex">\mathfrak {p} -adic).
منابع مشابه
The maximal total irregularity of some connected graphs
The total irregularity of a graph G is defined as 〖irr〗_t (G)=1/2 ∑_(u,v∈V(G))▒〖|d_u-d_v |〗, where d_u denotes the degree of a vertex u∈V(G). In this paper by using the Gini index, we obtain the ordering of the total irregularity index for some classes of connected graphs, with the same number of vertices.
متن کاملthe maximal total irregularity of some connected graphs
the total irregularity of a graph g is defined as 〖irr〗_t (g)=1/2 ∑_(u,v∈v(g))▒〖|d_u-d_v |〗, where d_u denotes the degree of a vertex u∈v(g). in this paper by using the gini index, we obtain the ordering of the total irregularity index for some classes of connected graphs, with the same number of vertices.
متن کاملMaximal Common Connected Sets of Interval Graphs
Given a pair of graph G1 = (V,E1), G2 = (V,E2) on the same vertex set, a set S ⊆ V is a maximal common connected set of G1 and G2 if the subgraphs of G1 and G2 induced by S are both connected and S is maximal the inclusion order. The maximal Common Connected sets Problem (CCP for short) consists in identifying the partition of V into maximal common connected sets of G1 and G2. This problem has ...
متن کاملConnected Finite Loop Spaces with Maximal Tori
Finite loop spaces are a generalization of compact Lie groups. However, they do not enjoy all of the nice properties of compact Lie groups. For example, having a maximal torus is a quite distinguished property. Actually, an old conjecture, due to Wilkerson, says that every connected finite loop space with a maximal torus is equivalent to a compact connected Lie group. We give some more evidence...
متن کاملOn Maximal Ideals of Compact Connected Topological Semigroups
Definition 1.1. A topological semigroup is a topological space S together with a continuous function m : S × S → S such that S is Hausdorff andm is associative. A subsemigroup of a semigroup S is a nonvoid set A ⊂ S such that A2 ⊂ A, and A is called a subgroup of S if it is a group with respect tom. An element e of a topological semigroup S is called an idempotent if e2 e. Similarly, an element...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2022
ISSN: ['2330-0000']
DOI: https://doi.org/10.1090/btran/112